Diffraction of Stochastic Point Sets: Explicitly Computable Examples
نویسندگان
چکیده
منابع مشابه
Diffraction of Stochastic Point Sets: Explicitly Computable Examples
Stochastic point processes relevant to the theory of long-range aperiodic order are considered that display diffraction spectra of mixed type, with special emphasis on explicitly computable cases together with a unified approach of reasonable generality. The latter is based on the classical theory of point processes and the Palm distribution. Several pairs of autocorrelation and diffraction mea...
متن کاملComputable counter-examples to the Brouwer fixed-point theorem
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and noncomputable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for finding the fixed point in general by giving an example of a computable function which does not fix any computable point. Research in reverse mathematics has...
متن کاملar X iv : 0 80 3 . 12 66 v 1 [ m at h - ph ] 8 M ar 2 00 8 DIFFRACTION OF STOCHASTIC POINT SETS : EXACTLY SOLVABLE EXAMPLES
Stochastic point sets are considered that display a diffraction spectrum of mixed type, with special emphasis on explicitly computable cases together with a unified approach of reasonable generality. Several pairs of autocorrelation and diffraction measures are discussed which show a duality structure that may be viewed as analogues of the Poisson summation formula for lattice Dirac combs.
متن کاملNon-computable Julia sets
Polynomial Julia sets have emerged as the most studied examples of fractal sets generated by a dynamical system. Apart from the beautiful mathematics, one of the reasons for their popularity is the beauty of the computer-generated images of such sets. The algorithms used to draw these pictures vary; the most näıve work by iterating the center of a pixel to determine if it lies in the Julia set....
متن کاملOrder-Computable Sets
We give a straightforward computable-model-theoretic definition of a property of ∆2 sets, called order-computability. We then prove various results about these sets which suggest that, simple though the definition is, the property defies any characterization in pure computability theory. The most striking example is the construction of two computably isomorphic c.e. sets, one of which is order-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2009
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-009-0942-x